A Polynomial Algorithm of Optimum Cutting a Rectangle into Rectangles with Two Heights
نویسنده
چکیده
We consider the problem of guillotine cutting a rectangular sheet into rectangular pieces with two heights. A polynomial time algorithm for this problem is constructed.
منابع مشابه
On Weighted Rectangle Packing with Large Resources
We study the problem of packing a set of n rectangles with weights into a dedicated rectangle so that the weight of the packed rectangles is maximized. We consider the case of large resources, that is, the side length of all rectangles is at most 1 and the side lengths of the dedicated rectangle differ by a factor of at least 1="4, for a fixed positive " > 0. We present an algorithm which finds...
متن کاملA Near-optimal Solution to a Two-dimensional Cutting Stock Problem a Near-optimal Solution to a Two-dimensional Cutting Stock Problem a Near-optimal Solution to a Two-dimensional Cutting Stock Problem
We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of xed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm nds a packing of n rectangles whose total height is within a factor of (1 +) of optimal (up to an additive term), and has running time polynomial both in n and in 1==. It is based on a r...
متن کاملA Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of xed width and minimum height, a classical N P-hard cutting-stock problem. The algorithm nds a packing of n rectangles whose total height is within a factor of (1 +) of optimal (up to an additive term), and has running time polynomial both in n and in 1==. It is based on a ...
متن کاملPartitioning orthogonal polygons into fat rectangles in polynomial time
We provide a polynomial-time algorithm to partition an orthogonal polygon of n vertices into isothetic rectangles so that the shortest rectangle side is maximized over all rectangles. Thus no rectangle is “thin”; all rectangles are “fat.”
متن کاملApproximate Strip Packing - Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on
We present an qpproximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm find,!; a packing of n rectangles whose total height is within a ,factor of (1 + E ) of optimal, and has running time polynomial both in n and in 1 / E . It is based on a reduction to fractional bin-packing, and ...
متن کامل